منابع مشابه
Definability of Initial Segments
Let T be a first order theory formulated in the language L and P a new relation symbol not in L. Let φ(P ) be an L ∪ {P}-sentence. Let us say that φ(P ) defines P implicitly in T if T proves φ(P ) ∧ φ(P ) → ∀x(P (x) ↔ P (x)). Beth’s definability theorem states that if φ(P ) defines P implicitlly in T then P (x) is equivalent to an L-formula. However, if we consider implicit definability in a gi...
متن کاملKolmogorov complexity of initial segments of sequences and arithmetical definability
The structure of the K-degrees provides a way to classify sets of natural numbers or infinite binary sequences with respect to the level of randomness of their initial segments. In the K-degrees of infinite binary sequences, X is below Y if the prefix-free Kolmogorov complexity of the first n bits of X is less than the complexity of the first n bits of Y , for each n. Identifying infinite binar...
متن کاملCombining Initial Segments of Lists
We propose a new way to build a combined list from K base lists, each containing N items. A combined list consists of top segments of various sizes from each base list so that the total size of all top segments equals N . A sequence of item requests is processed and the goal is to minimize the total number of misses. That is, we seek to build a combined list that contains all the frequently req...
متن کاملLattice Initial Segments of the Turing Degrees
Lattice Initial Segments of the Turing Degrees
متن کاملOn initial segments of computable linear orders
We show there is a computable linear order with a 02 initial segment that is not isomorphic to any computable linear order.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2002
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1071509428